FUNCTIONAL PEARLSCombinators for Breadth - First
نویسنده
چکیده
منابع مشابه
Search strategies for functional logic programming
In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.
متن کاملAlgebras for Combinatorial Search
We show how combinatorial search strategies including depth-first, breadth-first and depth-bounded search can be viewed as different implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting that combines algebraic specifications and monads. This article appeared in Workshop on Mathematically...
متن کاملReinventing Haskell Backtracking
Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes, we show how to arrive at the efficient, two-continuation based backtracking monad derived by Hinze starting from an intuitive inefficient implementation that we subsequently refine using well known program transformat...
متن کاملThe Predictive Power of Syntactic Knowledge, Vocabulary Breadth and Metacognitive Strategies for L2 Reading Fluency
Fluent reading is a multifaceted ability that integrates several linguistic and non-linguistic processes. Accordingly, recognizing the critical components of fluent reading is highly significant in planning and implementing effective reading programs. This study was undertaken to evaluate the predictive power of syntactic knowledge, vocabulary breadth, and metacognitive awareness of reading str...
متن کاملBreadth first search coding of multitype forests with application to Lamperti representation
We obtain a bijection between some set of multidimensional sequences and this of d-type plane forests which is based on the breadth first search algorithm. This coding sequence is related to the sequence of population sizes indexed by the generations, through a Lamperti type transformation. The same transformation in then obtained in continuous time for multitype branching processes with discre...
متن کامل